Sojourn time test for maximum-length linearly recurring sequences with characteristic primitive trinomials
نویسندگان
چکیده
منابع مشابه
Twelve New Primitive Binary Trinomials
We exhibit twelve new primitive trinomials over GF(2) of record degrees 42 643 801, 43 112 609, and 74 207 281. In addition we report the first Mersenne exponent not ruled out by Swan’s theorem [10] — namely 57 885 161 — for which none primitive trinomial exists. This completes the search for the currently known Mersenne prime exponents. Primitive trinomials of degree up to 32 582 657 were repo...
متن کاملTen new primitive binary trinomials
We exhibit ten new primitive trinomials over GF(2) of record degrees 24 036 583, 25 964 951, 30 402 457, and 32 582 657. This completes the search for the currently known Mersenne prime exponents. Primitive trinomials of degree up to 6 972 593 were previously known [4]. We have completed a search for all known Mersenne prime exponents [7]. Ten new primitive trinomials were found. Our results ar...
متن کاملOn Primitive Trinomials (Mode 2), II
The present paper is a completion of a previous paper of the same title (Zierler and Brillhart, 1968). In our preceding work 187 of the irreducible trinomials T~.k(x) = x" ~ x k ~1 were left to be tested for primitivity at a later date, even though the requisite complete factorizations of 2 ~ 1 were known (these trinomials were identified in (Zierler and Brillhart, 1968) by a superscript minus ...
متن کاملAlgorithms for Finding Almost Irreducible and Almost Primitive Trinomials
Consider polynomials over GF(2). We describe efficient algorithms for finding trinomials with large irreducible (and possibly primitive) factors, and give examples of trinomials having a primitive factor of degree r for all Mersenne exponents r = ±3 mod 8 in the range 5 < r < 10, although there is no irreducible trinomial of degree r. We also give trinomials with a primitive factor of degree r ...
متن کاملRedundant Trinomials for Finite Fields of Characteristic 2
In this paper we introduce so-called redundant trinomials to represent elements of nite elds of characteristic 2. The concept is in fact similar to almost irreducible trinomials introduced by Brent and Zimmermann in the context of random numbers generators in [BZ ]. See also [BZ]. In fact, Blake et al. [BGL , BGL ] and Tromp et al. [TZZ ] explored also similar ideas some years a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Japanese Society of Computational Statistics
سال: 1994
ISSN: 0915-2350,1881-1337
DOI: 10.5183/jjscs1988.7.77